Complex scale-free networks with tunable power-law exponent and clustering
نویسندگان
چکیده
منابع مشابه
Complex scale-free networks with tunable power-law exponent and clustering
We introduce a network evolution process motivated by the network of citations in the scientific literature. In each iteration of the process a node is born and directed links are created from the new node to a set of target nodes already in the network. This set includes m “ambassador” nodes and l of each ambassador’s descendants where m and l are random variables selected from any choice of d...
متن کاملGrowing scale-free networks with tunable clustering.
We extend the standard scale-free network model to include a "triad formation step." We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with th...
متن کاملEvolving Scale-free Network Model with Tunable Clustering
The Barabási-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability p, we add a new node with m edges which preferentially link to the nodes presented in the network; with probability 1− p, we add m edges among the present nodes. A node is preferentially selected by its degree to add an edge randomly among its neighbors. U...
متن کاملFlexible construction of hierarchical scale-free networks with general exponent.
Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidence for hierarchical organization in many real networks has also been reported. Here, we present a hierarchical model that reproduces the main experimental properties observed in real networks: scale-free of degree distribution P (k) [frequency of the nodes that are connected to k...
متن کاملGiant component sizes in scale-free networks with power-law degrees and cutoffs
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree ∆. We investigate the relative size of the giant component S in the large-network limit. We show that S as a function of ∆ increases fast when ∆ is just large enough for the giant component to exist, but increases ever more sl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2013
ISSN: 0378-4371
DOI: 10.1016/j.physa.2013.06.063